Computational speed-up with a single qudit
نویسندگان
چکیده
منابع مشابه
Computational speed-up with a single qudit
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given ...
متن کاملLinear optical demonstration of quantum speed-up with a single qudit.
Quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding quantum physics. We experimentally realize a quantum speed-up algorithm with a single qudit via linear optics and prove that even a single qudit is enough for designi...
متن کاملOn Computational Speed-Up
Let J? be any effective mapping from total functions on the integers to total functions. Composition and iterated composition are examples of such mappings. The "operator speed-up theorem in this paper establishes the existence of a computable function f such that for any program computing f(x) in Pj(x) steps for all x, there is another program computing f(x) in p 0(x) steps and F(p 0) < palmos...
متن کاملQuantum Clock Synchronization with a Single Qudit
Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies. A reliable system must be able to resynchronize the nonfaulty processes upon some components failing causing the distribution of incorrect or conflicting information in the network. The task of synchronizing such networks is related to Byzantine agreement (BA), which can classi...
متن کاملOn the role of entanglement in quantum computational speed-up
For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed-up over classical computation. Furthermore we prove that the algorithm can be classically efficiently simulated to within a prescribed tolerance η e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2015
ISSN: 2045-2322
DOI: 10.1038/srep14671